cody - HTMLify profile
files of /cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS On Answer/
3problem solution.text
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS On Answer/3problem solution.text
Painter Partition --> Split Array Largest Sum --> Book Allocation Problem --> Has same solution
Book Allocation Problem.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS On Answer/Book Allocation Problem.cpp
class Solution {
public:
int countStudents(vector<int> &nums, int k) {
int n = nums.size(); //size of array.
int stu
public:
int countStudents(vector<int> &nums, int k) {
int n = nums.size(); //size of array.
int stu
Find Duplicate in Array.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS On Answer/Find Duplicate in Array.cpp
#include <bits/stdc++.h>
int findDuplicate(vector<int> &arr, int n){
// Write your code here.
sort(arr.begin(), arr.end());
int findDuplicate(vector<int> &arr, int n){
// Write your code here.
sort(arr.begin(), arr.end());
Find Nth Root Of M.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS On Answer/Find Nth Root Of M.cpp
int NthRoot(int n, int m) {
// Write your code here.
int start = 1;
int end = m;
while(start<=end){
int mid = s
// Write your code here.
int start = 1;
int end = m;
while(start<=end){
int mid = s
Painter's partition.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS On Answer/Painter's partition.cpp
class Solution {
public:
int countStudents(vector<int> &nums, int k) {
int n = nums.size(); //size of array.
int stu
public:
int countStudents(vector<int> &nums, int k) {
int n = nums.size(); //size of array.
int stu
Search Insert Position.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS On Answer/Search Insert Position.cpp
int searchInsert(vector<int>& arr, int m)
{
// Write your code here.
int n = arr.size();
int start = 0;
int end = n-1;
{
// Write your code here.
int n = arr.size();
int start = 0;
int end = n-1;
Split array - Largest Sum.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS On Answer/Split array - Largest Sum.cpp
class Solution {
public:
int countStudents(vector<int> &nums, int k) {
int n = nums.size(); //size of array.
int stu
public:
int countStudents(vector<int> &nums, int k) {
int n = nums.size(); //size of array.
int stu
Square Root of a number.cpp
/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Binary Search/BS On Answer/Square Root of a number.cpp
int floorSqrt(int n)
{
// Write your code here.
int low =1,high=n;